- Title
- Minimum linear arrangement of incomplete hypercubes
- Creator
- Miller, Mirka; Sundara Rajan, R.; Parthiban, N.; Rajasingh, Indra
- Relation
- Computer Journal Vol. 58, Issue 2, p. 331-337
- Publisher Link
- http://dx.doi.org/10.1093/comjnl/bxu031
- Publisher
- Oxford University Press
- Resource Type
- journal article
- Date
- 2015
- Description
- The minimum linear arrangement problem is a combinatorial optimization problem whose goal is to find a linear layout of a network in such way that a certain objective cost function is optimized. In this paper, we compute the minimum linear arrangement of incomplete hypercubes using graph embeddings.
- Subject
- minimum linear arrangement; embedding; incomplete hypercube
- Identifier
- http://hdl.handle.net/1959.13/1335749
- Identifier
- uon:27495
- Identifier
- ISSN:0010-4620
- Language
- eng
- Reviewed
- Hits: 805
- Visitors: 759
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|